多种分布下选择后变量显著性分析及其在CEPS数据中的应用

在使用变量选择方法选出模型后,如何评价模型中变量系数的显著性是统计学重点关注的前沿问题之一.文章从适应性Lasso变量选择方法的选择结果出发,在考虑实践中误差分布多样性的前提下,基于选择事件构造了模型保留变量系数的条件检验统计量,并给出了该统计量的一致收敛性质的证明过程.模拟研究显示,在多种误差分布下所提方法均可进一步优化变量选择结果,有较强的实用价值.应用此方法对CEPS学生数据进行了实证分析,最终选取了学生认知能力等10个变量作为影响中学生成绩的主要因素,为相关研究提供了有益的参考.     

3种现场快速水质检测仪的性价对比

选择了市场上口碑好、占有率高的3款便携式水质现场应急检测设备,通过准确度、精密度、检测时长及价格等指标,以权重积分法对3款仪器进行了比选,结果表明德国MN公司的PF-12型便携式多参数分光光度计的综合性能最优.     

A robust decentralized reputation management system for service selection

Reputation mechanism is a novel approach to automate QoS-aware service selection in service oriented computing. The reputation system collects ratings on QoS that consumers feedback and aggregates them to derive a reputation value, which can in turn assist other consumers in service selection in future. However, current approaches fail to combat the malicious ratings and hence the calculated reputation values can be biased severely or even manipulated. Moreover, the centralized management of rating data restricts its application to large open environment. In this paper, we present a robust decentralized reputation system which can resist various unfair ratings and manipulation behaviours. It can evolve and become more mature against malicious ratings with the system running continuously. At last, we experimentally verify the robustness of the proposed approach through a simulation study.     

三维荧光光谱的特征区域选择方法

将数学中的二元凸函数判定和数据挖掘中的聚类分析方法结合,提出了针对三维荧光的光谱区域选择方法,并利用此种方法从光谱图中提取出含有丰富光谱信息的凸集区域。对水体中总有机碳的检测和白酒中黄曲霉素的检测进行了实验研究,实验结果表明,采用本文提出的三维荧光光谱区域选择方法提高了模型的精度,与利用全光谱所建立的回归模型相比,模型精度分别提高了6.17%和4.97%。     

Performance monitoring of a mammalian cell based bioprocess using Raman spectroscopy

Being able to predict the final product yield at all stages in long-running, industrial, mammalian cell culture processes is vital for both operational efficiency, process consistency, and the implementation of quality by design (QbD) practices. Here we used Raman spectroscopy to monitor (in terms of glycoprotein yield prediction) a fed-batch fermentation from start to finish. Raman data were collected from 12 different time points in a Chinese hamster ovary (CHO) based manufacturing process and across 37 separate production runs. The samples comprised of clarified bioprocess broths extracted from the CHO cell based process with varying amounts of fresh and spent cell culture media. Competitive adaptive reweighted sampling (CoAdReS) and ant colony optimization (ACO) variable selection methods were used to enhance the predictive ability of the chemometric models by removing unnecessary spectral information. Using CoAdReS accurate prediction models (relative error of predictions between 2.1% and 3.3%) were built for the final glycoprotein yield at every stage of the bioprocess from small scale up to the final 5000 L bioreactor. This result reinforces our previous studies which indicate that media quality is one of the most significant factors determining the efficiency of industrial CHO-cell processes. This Raman based approach could thus be used to manage production in terms of selecting which small scale batches are progressed to large-scale manufacture, thus improving process efficiency significantly.     

Optimal Groomings with Grooming Ratios Six and Seven

Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs.     

Forwarding and optical indices of 4-regular circulant networks

An all-to-all routing in a graph G is a set of oriented paths of G, with exactly one path for each ordered pair of vertices. The load of an edge under an all-to-all routing R is the number of times it is used (in either direction) by paths of R, and the maximum load of an edge is denoted by $\pi (G,R)$. The edge-forwarding index $\pi (G)$ is the minimum of $\pi (G,R)$ over all possible all-to-all routings R, and the arc-forwarding index $\overrightarrow{\pi }(G)$ is defined similarly by taking direction into consideration, where an arc is an ordered pair of adjacent vertices. Denote by $w(G,R)$ the minimum number of colours required to colour the paths of R such that any two paths having an edge in common receive distinct colours. The optical index $w(G)$ is defined to be the minimum of $w(G,R)$ over all possible R, and the directed optical index $\overrightarrow{w}(G)$ is defined similarly by requiring that any two paths having an arc in common receive distinct colours. In this paper we obtain lower and upper bounds on these four invariants for 4-regular circulant graphs with connection set $\{\pm 1,\pm s\}$, $1<s<n/2$. We give approximation algorithms with performance ratio a small constant for the corresponding forwarding index and routing and wavelength assignment problems for some families of 4-regular circulant graphs.